Counting Satisfying Assignments in 2-SAT and 3-SAT
نویسندگان
چکیده
We present an O(1:3247 n) algorithm for counting the number of satisfying assignments for instances of 2-SAT and an O(1:6894 n) algorithm for instances of 3-SAT. This is an improvement compared to the previously best known algorithms running in O(1:381 n) and O(1:739 n) time, respectively.
منابع مشابه
Improved Bounds for Exact Counting of Satisfiability Solutions
An algorithm is presented for exactly solving (in fact, counting) the number of maximum weight satisfying assignments of a 2-SAT formula. The worst case running time of O(1.2461) for formulas with n variables improves on the previous bound of O(1.2561) by Dahllöf, Jonsson, and Wahlström. The weighted 2-SAT counting algorithm can be applied to obtain faster algorithms for combinatorial counting ...
متن کاملGeometric properties of satisfying assignments of random epsilon-1-in-k SAT
We study the geometric structure of the set of solutions of random ǫ-1-in-k SAT problem [2, 15]. For l ≥ 1, two satisfying assignments A and B are l-connected if there exists a sequence of satisfying assignments connecting them by changing at most l bits at a time. We first prove that w.h.p. two assignments of a random ǫ-1-in-k SAT instance are O(log n)-connected, conditional on being satisfyin...
متن کاملLecture 25
Given a DNF formula φ with n variables, DNF counting is the problem finding the number of satisfying assignments for φ. Note that in general satisfiability for DNF is easy as we need only satisfy a single clause, but the counting problem is hard. Indeed, if we could do this, then given any 3-CNF formula f with n variables, we could take its negation, count how many satisfying assignments its ne...
متن کاملOn Computing k-CNF Formula Properties
The latest generation of SAT solvers (e.g. [9, 5]) generally have three key features: randomization of variable selection, backtracking search, and some form of clause learning. We present a simple algorithm with these three features and prove that for instances with constant ∆ (where ∆ is the clause-to-variable ratio) the algorithm indeed has good worst-case performance, not only for computing...
متن کاملA Scalable Approximate Model Counter
Propositional model counting (#SAT), i.e., counting the number of satisfying assignments of a propositional formula, is a problem of significant theoretical and practical interest. Due to the inherent complexity of the problem, approximate model counting, which counts the number of satisfying assignments to within given tolerance and confidence level, was proposed as a practical alternative to ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002